a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
↳ QTRS
↳ DependencyPairsProof
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
B(b(a(x))) → B(b(x))
B(b(a(x))) → B(x)
B(b(a(x))) → A(b(b(x)))
A(a(x)) → B(b(x))
A(a(x)) → B(x)
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
B(b(a(x))) → B(b(x))
B(b(a(x))) → B(x)
B(b(a(x))) → A(b(b(x)))
A(a(x)) → B(b(x))
A(a(x)) → B(x)
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
B(b(a(x))) → B(b(x))
B(b(a(x))) → B(x)
B(b(a(x))) → A(b(b(x)))
A(a(x)) → B(b(x))
A(a(x)) → B(x)
The value of delta used in the strict ordering is 1/8.
POL(B(x1)) = x_1
POL(a(x1)) = 1/2 + (4)x_1
POL(A(x1)) = (1/4)x_1
POL(b(x1)) = x_1
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))